Time-Approximation Trade-offs for Inapproximable Problems
نویسندگان
چکیده
In this paper we focus on problems which do not admit a constant-factor approximation in polynomial time and explore how quickly their approximability improves as the allowed running time is gradually increased from polynomial to (sub-)exponential. We tackle a number of problems: For Min Independent Dominating Set, Max Induced Path, Forest and Tree, for any r(n), a simple, known scheme gives an approximation ratio of r in time roughly r. We show that, for most values of r, if this running time could be significantly improved the ETH would fail. For Max Minimal Vertex Cover we give a nontrivial √ r-approximation in time 2. We match this with a similarly tight result. We also give a log r-approximation for Min ATSP in time 2 and an r-approximation for Max Grundy Coloring in time r. Furthermore, we show that Min Set Cover exhibits a curious behavior in this superpolynomial setting: for any δ > 0 it admits an m-approximation, where m is the number of sets, in just quasi-polynomial time. We observe that if such ratios could be achieved in polynomial time, the ETH or the Projection Games Conjecture would fail. 1998 ACM Subject Classification F.1.3 Complexity Measures and Classes, F.2.2 Nonnumerical Algorithms and Problems, G.2.1 Combinatorics, G.2.2 Graph Theory
منابع مشابه
Ethical Perspective: Five Unacceptable Trade-offs on the Path to Universal Health Coverage
This article discusses what ethicists have called “unacceptable trade-offs” in health policy choices related to universal health coverage (UHC). Since the fiscal space is constrained, trade-offs need to be made. But some trade-offs are unacceptable on the path to universal coverage. Unacceptable choices include, among other examples from low-income countries, to expand coverage for services wit...
متن کاملStream ciphers and the eSTREAM project
Stream ciphers are an important class of symmetric cryptographic algorithms. The eSTREAM project contributed significantly to the recent increase of activity in this field. In this paper, we present a survey of the eSTREAM project. We also review recent time/memory/data and time/memory/key trade-offs relevant for the generic attacks on stream ciphers.
متن کاملDefining Pathways and Trade-offs Toward Universal Health Coverage; Comment on “Ethical Perspective: Five Unacceptable Trade-offs on the Path to Universal Health Coverage”
The World Health Organization’s (WHO’s) World Health Report 2010, “Health systems financing, the path to universal coverage,” promoted universal health coverage (UHC) as an aspirational objective for country health systems. Yet, in addition to the dimensions of services and coverage, distribution of coverage in the population, and financial risk protection highlighted by the report, the conside...
متن کاملA one-model approach for Computation of congestion With productions trade-offs and weight restrictions
متن کامل
Linear-Time Approximation Algorithms for Unit Disk Graphs
Numerous approximation algorithms for unit disk graphs have been proposed in the literature, exhibiting sharp trade-offs between running times and approximation ratios. We propose a method to obtain linear-time approximation algorithms for unit disk graph problems. Our method yields linear-time (4 + ε)-approximations to the maximum-weight independent set and the minimum dominating set, as well ...
متن کامل